Strategic Location-based Connected Dominating Set for Mobile Ad Hoc Networks

Wireless networks like mobile ad hoc networks are infrastructure-less networks and nodes in that network which communicate via radio propagation. In such networks, a Connected Dominating Set (CDS) can act as a virtual backbone, in order to make the routing efficient. A smaller virtual backbone incurs less communication overhead. Since computing a minimum CDS is NP-Complete, efficient approximation algorithms are used to find a CDS of small size. This work presents the CDS algorithm which is constructed based on strategy and location of the nodes. The mobile ad hoc networks area is partitioned into various regions based on location and homogeneous transmission range. In each region, a strategic node is selected and a CDS is constructed inside that region. A strategic CDS is constructed for the strategic nodes selected in all the regions of the network. These strategic CDS nodes are selected based on factors like location, density, transmission range, velocity, energy, frequency, power back-up and trust ability. The CDS nodes are selected based on the factors like density and velocity. The proposed algorithm can increase the lifetime of a CDS, decrease the time complexity involved in transmitting the message and increases the possibility of finding the routes between the nodes in the network.